Duality and Optimality Conditions for Infinite Dimensional Optimization Problems

نویسنده

  • Armin Ho
چکیده

Using a nonsymmetric duality for abstract continuous convex control problems opti-mality conditions are derived for calculating the primal and dual solutions in the case of linear on state depending dual operators. Functional and pointwise conditions are considered. Subject: 49K22, 49K27, 49N15, 90C42. Keywords: abstract optimal control , nonsymmetric duality, suucient conditions of optimality, optimal control involving integral equations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz‎. ‎Necessary optimality conditions and regularity conditions are given‎. ‎Our approach are based on the Michel-Penot subdifferential.

متن کامل

Duality for vector equilibrium problems with constraints

‎In the paper‎, ‎we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior‎. ‎Then‎, ‎their applications to optimality conditions for quasi-relative efficient solutions are obtained‎. ‎Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...

متن کامل

Mangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.

متن کامل

Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...

متن کامل

Optimality conditions and duality for multiobjective semi-infinite programming problems with generalized (C, α, ρ, d)-convexity

This paper deals with a nonlinear multiobjective semi-infinite programming problem involving generalized (C,α, ρ, d)-convex functions. We obtain sufficient optimality conditions and formulate the Mond-Weirtype dual model for the nonlinear multiobjective semi-infinite programming problem. We also establish weak, strong and strict converse duality theorems relating the problem and the dual problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993